A speed-up theorem without tape compression
نویسندگان
چکیده
منابع مشابه
A speed - up theorem for cryptosystems . ( 2000 , unpublished manuscript )
We show that any encryption/decryption system can be converted to an algorithm which uses roughly three machine operations per bit. We prove that our technique yields an encryption/decryption system which is as secure as the original system provided the plaintext has full-entropy. We then show how to remove the full-entropy assumption. Our techniques speed up software implementations of RSA by ...
متن کاملAn Investigation of Compression Techniques to Speed up Mutation Testing
Mutation testing is widely considered as a high-end test coverage criterion due to the vast number of mutants it generates. Although many efforts have been made to reduce the computational cost of mutation testing, in practice, the scalability issue remains. In this paper, we explore whether we can use compression techniques to improve the efficiency of strong mutation based on weak mutation in...
متن کاملThe compression theorem
The compression theorem solves a 20 year old problem [2; problem 6]. Applications include short new proofs for immersion theory and for the loops– suspension theorem of James et al and a new approach to classifying embeddings of manifolds in codimension one or more, which leads to theoretical solutions. The proof introduces a novel technique in differential topology: proof by dynamical systems....
متن کاملThe compression theorem I
This the first of a set of three papers about the Compression Theorem: if M is embedded in Q ×R with a normal vector field and if q−m ≥ 1, then the given vector field can be straightened (ie, made parallel to the given R direction) by an isotopy of M and normal field in Q× R. The theorem can be deduced from Gromov’s theorem on directed embeddings [5; 2.4.5 (C′)] and is implicit in the preceedin...
متن کاملANTS: Network Services Without the Red Tape
42 Computer H ow well distributed computing systems perform depends a great deal on the network services used to move information among their machines. Yet despite this close correspondence , network services have evolved much more slowly than any other part of the distributed system environment. It's not that the networking community lacks innovative ideas: Internet Protocol version 6, Mobile ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90362-w